The classification of graphs with a redundant inequality
نویسندگان
چکیده
A set of inequalities over a set of variables with their domain can contain a redundant inequality, i.e., an inequality that is implied by the others. A first classification of sets of inequalities with a redundant inequality is given for the case that all variables have the same domain. The strong link with graph coloring is exploited in the proofs. The classification of graphs with a redundant inequality Bart Demoen KU Leuven, Belgium Phuong-Lan Nguyen Université Catholique de l’Ouest, Angers, France January 12, 2013 Abstract A set of inequalities over a set of variables with their domain can contain a redundant inequality, i.e., an inequality that is implied by the others. A first classification of sets of inequalities with a redundant inequality is given for the case that all variables have the same domain. The strong link with graph coloring is exploited in the proofs.A set of inequalities over a set of variables with their domain can contain a redundant inequality, i.e., an inequality that is implied by the others. A first classification of sets of inequalities with a redundant inequality is given for the case that all variables have the same domain. The strong link with graph coloring is exploited in the proofs.
منابع مشابه
NORMAL 6-VALENT CAYLEY GRAPHS OF ABELIAN GROUPS
Abstract : We call a Cayley graph Γ = Cay (G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aut(Γ). In this paper, a classification of all non-normal Cayley graphs of finite abelian group with valency 6 was presented.
متن کاملNORMAL 6-VALENT CLAYEY GRAPHS OF ABELIAN GROUPS
We call a Clayey graph Γ = Cay(G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aunt(Γ). in this paper, we give a classification of all non-normal Clayey graphs of finite abelian group with valency 6.
متن کاملSome topological indices of graphs and some inequalities
Let G be a graph. In this paper, we study the eccentric connectivity index, the new version of the second Zagreb index and the forth geometric–arithmetic index.. The basic properties of these novel graph descriptors and some inequalities for them are established.
متن کاملA Novel Scheme for Improving Accuracy of KNN Classification Algorithm Based on the New Weighting Technique and Stepwise Feature Selection
K nearest neighbor algorithm is one of the most frequently used techniques in data mining for its integrity and performance. Though the KNN algorithm is highly effective in many cases, it has some essential deficiencies, which affects the classification accuracy of the algorithm. First, the effectiveness of the algorithm is affected by redundant and irrelevant features. Furthermore, this algori...
متن کاملMTBF evaluation for 2-out-of-3 redundant repairable systems with common cause and cascade failures considering fuzzy rates for failures and repair: a case study of a centrifugal water pumping system
In many cases, redundant systems are beset by both independent and dependent failures. Ignoring dependent variables in MTBF evaluation of redundant systems hastens the occurrence of failure, causing it to take place before the expected time, hence decreasing safety and creating irreversible damages. Common cause failure (CCF) and cascading failure are two varieties of dependent failures, both l...
متن کامل